Tractable Monotone Temporal Planning
نویسندگان
چکیده
This paper describes a polynomially-solvable subproblem of temporal planning. Polynomiality follows from two assumptions. Firstly, by supposing that each sub-goal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of sub-goal fluents allows us to express planning as an instance of STP. Our class includes temporally-expressive problems, which we illustrate with an example of chemical process planning.
منابع مشابه
Monotone Temporal Planning :
Wedescribe apolynomially-solvable class of temporal planning problems. Polynomiality follows from two assumptions. Firstly, by supposing that each fluent (fact) can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of fluents allows us to express planning as an instance of STP (Simple Temporal Problemwith differenc...
متن کاملMonotone Temporal Planning: Tractability, Extensions and Applications
This paper describes a polynomially-solvable class of temporal planning problems. Polynomiality follows from two assumptions. Firstly, by supposing that each sub-goal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of sub-goal fluents allows us to express planning as an instance of STP ≠ (Simple Tempor...
متن کاملOn the Computational Complexity of Temporal Projection, Planning, and Plan Validation
One kind of temporal reasoning is temporal projection|the computation of the consequences of a set of events. This problem is related to a number of other temporal reasoning tasks such as plan validation and planning. We show that one particular, simple case of temporal projection on partially ordered events turns out to be harder than previously conjectured, while planning is easy under the sa...
متن کاملThe Complexity of Satisfiability for Fragments of Hybrid Logic — Part I∗ Preliminary Version
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate the effect of restricting the propositional part of the language on decidability and on the complexity of the satisfiability problem over arbitrary, transitive, total frames, and frames based on eq...
متن کاملOn the Computational Complexity of Temporal Projection and Plan Validation
One kind of temporal reasoning is temporal projection|the computation of the consequences of a set of events. This problem is related to a number of other temporal reasoning tasks such as story understanding, planning, and plan validation. We show that one particular simple case of temporal projection on partially ordered events turns out to be harder than previously conjectured. However, given...
متن کامل